VDict - Definition of polynomial-time algorithms

Computing (FOLDOC) dictionary

polynomial-time algorithm

Jump to user comments

complexity A known algorithm (or Turing Machine) that is

guaranteed to terminate within a number of steps which is a

polynomial function of the size of the problem.

See also computational complexity, exponential time,

nondeterministic polynomial-time (NP), NP-complete.

(1995-04-13)

Related search result for "polynomial-time algorithm"

Words contain "polynomial-time algorithm" in its definition in Computing (FOLDOC) dictionary:
nondeterministic polynomial time polynomial-time algorithm metaheuristic feasible polynomial NP-hard polynomial-time exponential-time algorithm NP-complete cyclic redundancy check more...

Comments and discussion on the word "polynomial-time algorithm"